On strings containing all subsets as substrings
نویسندگان
چکیده
منابع مشابه
Reconstructing Strings from Substrings
We consider an interactive approach to DNA sequencing by hybridization, where we are permitted to ask questions of the form "is s a substring of the unknown sequence S?", where s is a specific query string. We are not told where s occurs in S, nor how many times it occurs, just whether or not s a substring of S. Our goal is to determine the exact contents of S using as few queries as possible. ...
متن کاملShort strings containing all k-element permutations
We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...
متن کاملShorter strings containing all k - element permutations
We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...
متن کاملGenerating Necklaces and Strings with Forbidden Substrings
Given a length m string f over a k-ary alphabet and a positive integer n, we develop eecient algorithms to generate (a) all k-ary strings of length n that have no substring equal to f, (b) all k-ary circular strings of length n that have no substring equal to f, and (c) all k-ary necklaces of length n that have no substring equal to f, where f is an aperiodic necklace. Each of the algorithms ru...
متن کاملReconstructing Strings from Substrings in Rounds
We establish a variety of combinatorial bounds on the tradeoos inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results lead us to propose a new approach to sequencing by hybridization (SBH), which uses interaction to dramatically reduce the number of oligonucleotides used for de novo sequencing of large DNA fragments, while preserving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1978
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90157-7